One Control Problem for a Set-valued Object

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some Results about Set-Valued Complementarity Problem

This paper is devoted to consider the notions of complementary problem (CP) and set-valued complementary problem (SVCP). The set-valued complementary problem is compared with the classical single-valued complementary problem. Also, the solution set of the set-valued complementary problem is characterized. Our results illustrated by some examples. This paper is devoted to co...

متن کامل

Approximation of Set-valued Functions by Single-valued One

Let Σ : M → 2 \ {∅} be a set-valued function defined on a Hausdorff compact topological space M and taking values in the normed space (Y, ‖·‖). We deal with the problem of finding the best Chebyshev type approximation of the set-valued function Σ by a singlevalued function g from a given closed convex set V ⊂ C(M, Y ). In an abstract setting this problem is posed as the extremal problem supt∈M ...

متن کامل

A fixed point result for a new class of set-valued contractions

In this paper, we introduce a new class of set-valued contractions and obtain a xed point theoremfor such mappings in complete metric spaces. Our main result generalizes and improves many well-known xed point theorems in the literature.

متن کامل

Control Problems for a Class of Set Valued Evolutions

The paper studies controllability problems for the reachable set of a differential inclusion. These were originally motivated by models of control of a flock of animals. Conditions are derived for the existence or nonexistence of a strategy which confines the reachable set within a given bounded region, at all sufficiently large times. Steering problems and the asymptotic shape of the reachable...

متن کامل

A Local Branching Approach for the Set Covering Problem

The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Modeling, Control and Information Technologies

سال: 2019

ISSN: 2707-1049,2707-1030

DOI: 10.31713/mcit.2019.01